A New Approximation Technique for Resource-Allocation Problems
نویسندگان
چکیده
We develop a rounding method based on random walks in polytopes, which leads to improved approximation algorithms and integrality gaps for several assignment problems that arise in resource allocation and scheduling. In particular, it generalizes the work of Shmoys & Tardos on the generalized assignment problem in two different directions, where the machines have hard capacities, and where some jobs can be dropped. We also outline possible applications and connections of this methodology to discrepancy theory and iterated rounding.
منابع مشابه
A New Fairness Index and Novel Approach for QoS-Aware Resource Allocation in LTE Networks Based on Utility Functions
Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...
متن کاملAllocating Fixed Costs: A Goal Programming Model Based on Data Envelopment Analysis
Today the most organizations (e.g. banks and insurance institutes) consist of the various units which under the control of the main organization (unified management) act independently. Sometimes the manager presents some services which incur costs such as advertisement and introducing a new technology. Most organizations consist of several individual units. Resource allocation issue appe...
متن کاملA Uniied Approach to Approximating Resource Allocation and Scheduling
We present a general framework for solving resource allocation and scheduling problems. Given a resource of xed size, we present algorithms that approximate the maximum throughput or the minimum loss by a constant factor. Our approximation factors apply to many problems, among which are: (i) real-time scheduling of jobs on parallel machines; (ii) bandwidth allocation for sessions between two en...
متن کاملA new approach for solving fuzzy multi-objective quadratic programming of water resource allocation problem
متن کامل
Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010